Eigenvalues of symmetric tridiagonal interval matrices revisited
نویسنده
چکیده
In this short note, we present a novel method for computing exact lower and upper bounds of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and avoids any assumptions Our construction explicitly yields those matrices for which particular lower and upper bounds are attained.
منابع مشابه
Spectral statistics for ensembles of various real random matrices
We investigate spacing statistics for ensembles of various real random matrices where the matrixelements have various Probability Distribution Function (PDF: f(x)) including Gaussian. For two modifications of 2 × 2 matrices with various PDFs, we derived that spacing distribution p(s) of adjacent energy eigenvalues are distinct. Nevertheless, they show the linear level repulsion near s = 0 as αs...
متن کاملAn O(N2 ) Method for Computing the Eigensystem of N ˟ N Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
An efficient method to solve the eigenproblem of N x N symmetric tridiagonal matrices is proposed. Unlike the standard eigensolvers that necessitate O(N3) operations to compute the eigenvectors of such matrices, the proposed method computes both the eigenvalues and eigenvectors with only O(N2) operations. The method is based on serial implementation of the recently introduced Divide and Conquer...
متن کاملInverse Spectral Problems for Tridiagonal N by N Complex Hamiltonians ⋆
In this paper, the concept of generalized spectral function is introduced for finite-order tridiagonal symmetric matrices (Jacobi matrices) with complex entries. The structure of the generalized spectral function is described in terms of spectral data consisting of the eigenvalues and normalizing numbers of the matrix. The inverse problems from generalized spectral function as well as from spec...
متن کاملOn computing accurate singular values and eigenvalues . . .
[15] D. O'Leary and G. W. Stewart. Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. [17] A. Sameh and D. Kuck. A parallel QR algorithm for symmetric tridiagonal matrices. [21] Zhonggang Zeng. The acyclic eigenproblem can be reduced to the arrowhead one. [22] Hongyuan Zha. A two-way chasing scheme for reducing a symmetric arrowhead matrix to tridiagonal form. Scientic ...
متن کاملNew inverse data for tridiagonal matrices
We introduce bidiagonal coordinates, a new set of spectral coordinates on open dense charts covering the space of real symmetric tridiagonal matrices of simple spectrum. In contrast to the standard inverse variables, consisting of eigenvalues and norming constants, reduced tridiagonal matrices now lie in the interior of some chart. Bidiagonal coordinates yield therefore an explicit atlas for TΛ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1704.03670 شماره
صفحات -
تاریخ انتشار 2017